hosoya polynomial of an infinite family of dendrimer nanostar
Authors
abstract
let g be a simple graph. the hosoya polynomial of g is ( , ) ,( , ) = { , } ( ) xd u v h g x u v v gwhere d(u,v) denotes the distance between vertices u and v . the dendrimer nanostar is apart of a new group of macromolecules. in this paper we compute the hosoya polynomial foran infinite family of dendrimer nanostar. as a consequence we obtain the wiener index andthe hyper-wiener index of this dendrimer.
similar resources
an infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولWiener Index of a New Type of Nanostar Dendrimer
Let G be a molecular graph. The Wiener index of G is defined as the summation of all distances between vertices of G. In this paper, an exact formula for the Wiener index of a new type of nanostar dendrimer is given.
full textOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
full textEccentric Related Indices of an Infinite Class of Nanostar Dendrimers
Clear indication has it in numerous studies that a strong inherent relationship exists between the chemical characteristics of chemical compounds and drugs (e.g., boiling point and melting point) and their molecular structures. There are several topological indices are defined on these chemical molecular structures and they can help researchers better understand the physical features, chemical ...
full textPI, Szeged and Edge Szeged Polynomials of a Dendrimer Nanostar
Let G be a graph with vertex and edge sets V(G) and E(G), respectively. As usual, the distance between the vertices u and v of a connected graph G is denoted by d(u,v) and it is defined as the number of edges in a minimal path connecting the vertices u and v. Throughout the paper, a graph means undirected connected graph without loops and multiple edges. In chemical graph theory, a molecular gr...
full textSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
full textMy Resources
Save resource for easier access later
Journal title:
iranian journal of mathematical chemistryPublisher: university of kashan
ISSN 2228-6489
volume 2
issue Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday) 2011
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023